On construction and generalization of algebraic geometry codes
نویسندگان
چکیده
The construction, estimation of minimum distance, and decoding algorithms of algebraic geometry codes can be explained without using advanced mathematics by the notion of weight domains. We clarify the relation between algebraic geometry codes and linear codes from weight domains. Then we review a systematic construction which yields all weight domains.
منابع مشابه
Construction and decoding of a class of algebraic geometry codes
Absfruct We construct a class of codes derived from algebraic plane curves. The concepts and results from algebraic geometry we use are explained in detail, and no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result is a decoding algorithm which turns out to be a generalization of the Peterson algorithm for decoding BCH c...
متن کاملLinear Codes on Nonsingular Curves are Better than Those on Singular Curves
Recently, Miura introduced a construction method of one-point algebraic geometry codes on singular curves, which is regarded as a generalization of one on nonsingular curves, and enables us to construct codes on wider class of algebraic curves. However, it is still not clear whether there really exist singular curves on which we can construct good codes that are never obtained from nonsingular ...
متن کاملCodes from Algebraic Number Fields
INTRODUCTION The geometry of numbers, coding theory, the Riemann hypothesis the list of key words for this lecture can be read äs a partial history of the Stichting Mathematisch Centrum. The lecture itself attempts to reflect the spirit of the SMC by displaying a new connection between these subjects. Using ideas from the geometry of numbers one can construct a class of codes from algebraic num...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملUnderstanding Algebraic-Geometric Codes
Error-correcting codes derived from curves in an algebraic geometry are called Algebraic-Geometry Codes. The past couple of decades has seen extraordinary developments in the application of the ideas of algebraic geometry to the construction of codes and their decoding algorithms. This was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed-Solomon (RS), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000